Package edu.claflin.finder.algo
Class EdgeBetweenness
- java.lang.Object
-
- edu.claflin.finder.algo.Algorithm
-
- edu.claflin.finder.algo.ClusteringAlgorithm
-
- edu.claflin.finder.algo.EdgeBetweenness
-
- All Implemented Interfaces:
Processable<Graph,Graph>
public class EdgeBetweenness extends ClusteringAlgorithm
Edge Betweenness with Girvan Newman Algorithm https://en.wikipedia.org/wiki/Girvan%E2%80%93Newman_algorithm- Author:
- Cesar Martin
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class edu.claflin.finder.algo.Algorithm
Algorithm.GraphSortOrder
-
-
Field Summary
-
Fields inherited from class edu.claflin.finder.algo.Algorithm
args, counter, listener, PROP_PROGRESS
-
-
Constructor Summary
Constructors Constructor Description EdgeBetweenness(ArgumentsBundle args)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description java.util.ArrayList<Graph>process(Graph graph)Performs Edge Betweenness community detection with Girvan-Newman algorithm a given Graph, returning the clustering with the maximum modularity.-
Methods inherited from class edu.claflin.finder.algo.ClusteringAlgorithm
buildCommunityGraphs
-
Methods inherited from class edu.claflin.finder.algo.Algorithm
addPropertyChangeListener, cull, getGraphSortOrder, getPartiteNumber, removePropertyChangeListener, setGraphSortOrder, setPartiteNumber, setProgress
-
-
-
-
Constructor Detail
-
EdgeBetweenness
public EdgeBetweenness(ArgumentsBundle args)
-
-
Method Detail
-
process
public java.util.ArrayList<Graph> process(Graph graph)
Performs Edge Betweenness community detection with Girvan-Newman algorithm a given Graph, returning the clustering with the maximum modularity.- Parameters:
graph- the Graph to perform FastGreedy on- Returns:
- the list of Graphs representing the clustering with the maximum modularity
-
-